声学超表面的非对称声分束特性研究

非对称声分束超表面是由人工微单元结构按照特定序列构建的二维平面结构,可将垂直入射的声波分成两束传播方向和分束比自由调控的透射波,在声功能器件设计及声通信领域具有广泛的应用前景。本文系统研究了一种实现非对称声分束的设计理论和实现方法,基于局域声功率守恒条件研究了声分束器的设计理论、阻抗矩阵分布、法向声强分布、声压场分布等。利用遗传算法对四串联共振腔结构进行参数优化实现了声分束器所需的阻抗矩阵分布,声压场分布表明声波入射到声分束器后在入射侧激发出两列传播方向相反且幅值和衰减系数均相同的表面波,实现了入射侧与透射侧的局域声功率相互匹配。声波经过声分束器后被分为两束透射波,两束透射波的折射角和透射系数与理论值十分吻合,证明了设计理论及实现方法的正确性和可行性。本文的研究工作可以为新型非对称声分束结构设计提供理论参考、设计方法和技术支持,并促进其在工程领域的实际应用。     

Linearizability of planar polynomial Hamiltonian systems

Isochronicity and linearizability of two-dimensional polynomial Hamiltonian systems are revisited and new results are presented. We give a new computational procedure to obtain the necessary and sufficient conditions for the linearization of a polynomial system. Using computer algebra systems we provide necessary and sufficient conditions for linearizability of Hamiltonian systems with homogeneous non-linearities of degrees 5, 6 and 7. We also present some sufficient conditions for systems with nonhomogeneous nonlinearities of degrees two, three and five.     

基于Kronecker型替换的黑盒多项式稀疏插值

本文基于新的Kronecker型替换,给出两个由黑盒表示的稀疏多项式的新确定性插值算法.令f∈R[x1,……,xn]是一个稀疏黑盒多项式,其次数上界为D.当R是C或者是有限域时,相对于已有算法,新算法具有更好的计算复杂度或者关于D的复杂度更低.特别地,对于一般黑盒模型,D是复杂度中的主要因素,而在所有的确定性算法中,本文的第二个算法的复杂度关于D是最低的.     

Finite element computations of viscoelastic two-phase flows using local projection stabilization

A three-field local projection stabilized (LPS) finite element method is developed for computations of a three-dimensional axisymmetric buoyancy driven liquid drop rising in a liquid column where one of the liquid is viscoelastic. The two-phase flow is described by the time-dependent incompressible Navier-Stokes equations, whereas the viscoelasticity is modeled by the Giesekus constitutive equation in a time-dependent domain. The arbitrary Lagrangian-Eulerian (ALE) formulation with finite elements is used to solve the governing equations in the time-dependent domain. Interface-resolved moving meshes in ALE allows to incorporate the interfacial tension force and jumps in the material parameters accurately. A one-level LPS based on an enriched approximation space and a discontinuous projection space is used to stabilize the numerical scheme. A comprehensive numerical investigation is performed for a Newtonian drop rising in a viscoelastic fluid column and a viscoelastic drop rising in a Newtonian fluid column. The influence of the viscosity ratio, Newtonian solvent ratio, Giesekus mobility factor, and the Eötvös number on the drop dynamics are analyzed. The numerical study shows that beyond a critical Capillary number, a Newtonian drop rising in a viscoelastic fluid column experiences an extended trailing edge with a cusp-like shape and also exhibits a negative wake phenomena. However, a viscoelastic drop rising in a Newtonian fluid column develops an indentation around the rear stagnation point with a dimpled shape.     

Multi-variable special polynomials using an operator ordering method

Using an operator ordering method for some commutative superposition operators, we introduce two new multi-variable special polynomials and their generating functions, and present some new operator identities and integral formulas involving the two special polynomials. Instead of calculating complicated partial differential, we use the special polynomials and their generating functions to concisely address the normalization, photocount distributions and Wigner distributions of several quantum states that can be realized physically, the results of which provide real convenience for further investigating the properties and applications of these states.     

The connected partition lattice of a graph and the reconstruction conjecture

Previously we showed that many invariants of a graph can be computed from its abstract induced subgraph poset, which is the isomorphism class of the induced subgraph poset, suitably weighted by subgraph counting numbers. In this paper, we study the abstract bond lattice of a graph, which is the isomorphism class of the lattice of distinct unlabelled connected partitions of a graph, suitably weighted by subgraph counting numbers. We show that these two abstract posets can be constructed from each other except in a few trivial cases. The constructions rely on certain generalisations of a lemma of Kocay in graph reconstruction theory to abstract induced subgraph posets. As a corollary, trees are reconstructible from their abstract bond lattice. We show that the chromatic symmetric function and the symmetric Tutte polynomial of a graph can be computed from its abstract induced subgraph poset. Stanley has asked if every tree is determined up to isomorphism by its chromatic symmetric function. We prove a counting lemma, and indicate future directions for a study of Stanley's question.